Erratum to: Bandlimited graph signal reconstruction by diffusion operator
نویسندگان
چکیده
1 Erratum Following publication of this article [1], it has come to our attention that the acknowledgements were captured incorrectly and the correct acknowledgements should include the following: This work is supported in part by National Natural Science Foundation of China (NSFC 61271181) and Foundation of Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory.
منابع مشابه
Bandlimited graph signal reconstruction by diffusion operator
Signal processing on graphs extends signal processing concepts and methodologies from the classical signal processing theory to data indexed by general graphs. For a bandlimited graph signal, the unknown data associated with unsampled vertices can be reconstructed from the sampled data by exploiting the spatial relationship of graph signal. In this paper, we propose a generalized analytical fra...
متن کاملSampling of operators
Sampling and reconstruction of functions is a central tool in science. A key sampling result is given by the classical sampling theorem for bandlimited functions which is often attributed to Whittaker, Shannon, Nyquist, and Kotelnikov. We develop an analogous sampling theory for operators whose Kohn-Nirenberg symbols are bandlimited. We prove sampling theorems for in this sense bandlimited oper...
متن کاملStructured sampling and fast reconstruction of smooth graph signals
This work concerns sampling of smooth signals on arbitrary graphs. We first study a structured sampling strategy for such smooth graph signals that consists of a random selection of few pre-defined groups of nodes. The number of groups to sample to stably embed the set of k-bandlimited signals is driven by a quantity called the group graph cumulative coherence. For some optimised sampling distr...
متن کاملEchantillonnage de signaux sur graphes via des processus déterminantaux
We consider the problem of sampling k-bandlimited graph signals, i.e., linear combinations of the first k graph Fourier modes. We know that a set of k nodes embedding all k-bandlimited signals always exists, thereby enabling their perfect reconstruction after sampling. Unfortunately, to exhibit such a set, one needs to partially diagonalize the graph Laplacian, which becomes prohibitive at larg...
متن کاملLocal measurement and reconstruction for noisy bandlimited graph signals
Signals and information related to networks can be modeled and processed as graph signals. It has been shown that if a graph signal is smooth enough to satisfy certain conditions, it can be uniquely determined by its decimation on a subset of vertices. However, instead of the decimation, sometimes local combinations of signals on different sets of vertices are obtained in potential applications...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017